Braess-like paradoxes in distributed computer systems

نویسندگان

  • Hisao Kameda
  • Eitan Altman
  • Takayuki Kozawa
  • Yoshihisa Hosokawa
چکیده

We consider optimal distributed decisions in distributed computer systems. We identify a Braess-like paradox in which adding capacity to the system may degrade the performance of all users. Unlike the original Braess paradox, we show that this behavior occurs only in the case of finitely many users and not in the case of infinite number of users. keywords Braess paradox, Nash equilibrium, Wardrop equilibrium, performance optimization, distributed computer system, load balancing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Studies on Braess-like Paradoxes for Non-Cooperative Dynamic Load Balancing in Distributed Computer Systems

Department of Computer Science, Faculty of Science, Menoufia University, Shebin El-Koom, Egypt. Email: [email protected] Abstract We consider a distributed computer system in Wardrop equilibrium, i.e., situations where no user can reduce its own response time by unilaterally choosing another path, if all the other users retain their present paths. The Braess paradox is a famous example of para...

متن کامل

Braess Paradox in Non-Cooperative Dynamic Load Balancing For the Cohen-Kelly Computer Network Model

---------------------------------------------ABSTRACT-----------------------------------------We consider a distributed computer system in Wardrop equilibrium, i.e., situations where no user can reduce its own response time by unilaterally choosing another path, if all the other users retain their present paths. The Braess paradox is a famous example of paradoxical cases where adding capacity t...

متن کامل

Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems

Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have been reported. Unlike the original Braess paradox, in the models examined, this behavior occurs only in the case of finitely many users and not in the case of infinite number of users and the degree of performance degradation can incre...

متن کامل

Network architecture and traffic flows: Experiments on the Pigou-Knight-Downs and Braess Paradoxes

This paper presents theory and experiments to investigate how network architecture influences route-choice behavior. We consider changes to networks that, theoretically, exhibit the PigouKnight-Downs and Braess Paradoxes. We show that these paradoxes are specific examples of more general classes of network change properties that we term the “least congestible route” and “size” principles, respe...

متن کامل

Paradoxes in Performance Optimization of Distributed Systems

|Re ecting the way in which a distributed system is used, we have di erent levels of distribution in the decisions on performance optimization for the distributed system, ranging from the completely centralized to the completely distributed. We identify such paradoxes that adding capacity to the system may degrade the performance of all users in the optimum of some intermediately distributed de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Automat. Contr.

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2000